On the Minimum Number of Fixed Length Sequences with Fixed Total Probability
نویسندگان
چکیده
منابع مشابه
On the fixed number of graphs
A set of vertices $S$ of a graph $G$ is called a fixing set of $G$, if only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph, if its fix...
متن کاملMinimum Length Embedding of Planar Graphs at Fixed Vertex Locations
We consider the problem of finding a planar embedding of a graph at fixed vertex locations that minimizes the total edge length. The problem is known to be NP-hard. We give polynomial time algorithms achieving an O( √ n logn) approximation for paths and matchings, and an O(n) approximation for general graphs.
متن کاملOn the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملSimulation of Fixed Length Word String Probability Distributions
I. WORD STRING DISTRIBUTION SIMULATION The aim of this description is to provide a framework for simulating specific word string distributions whose general structure follows the structure of word string posterior distributions relevant for string recognition. For the specific case of string classes w 1 = w1, w2, . . . , wN of fixed length N with words wn ∈ V , with vocabulary size V = |V|, and...
متن کاملGenerating fixed-length sequences satisfying any given nth-order transition probability matrix.
An experimental design involving sequences of m distinct events can be conceptualized as an nth-order transition probability matrix specifying the probabilities with which each of the m distinct events is to follow certain n-grams. This paper describes a general method for constructing sequences of shortest possible length that satisfy any such matrix and presents a computer program that random...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1976
ISSN: 0091-1798
DOI: 10.1214/aop/1176996139